A general class of explicit pseudo two - stepRKN methods on parallel computers

نویسنده

  • Nguyen Huu Cong
چکیده

The aim of this paper is to investigate a general class of explicit pseudo two-step Runge-Kutta-Nystrr om methods (RKN methods) of arbitrarily high order for nonstii problems for systems of special second-order diierential equations y 00 (t) = f(y(t)). Order and stability considerations show that we can obtain for any given p, a stable pth-order explicit pseudo two-step RKN method requiring p ? 2 right-hand side evaluations per step of which each evaluation can be obtained in parallel. Consequently, on a multi-processor computer, only one sequential right-hand side evaluation per step is required. By a few widely-used test problems, we show the superiority of the methods considered in this paper over both sequential and parallel methods available in the literature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Class of Explicit Two - Step Runge - KuttaMethods with Enlarged Stability Regions

In this paper we study a class of explicit pseudo two-step Runge-Kutta (EP-TRK) methods for rst-order ODEs for parallel computers. We investigate linear stability and derive methods with enlarged stability regions. In numerical experiments on a shared memory computer we compare a parallel variable step size EPTRK implementation with the eecient sequential Runge-Kutta method dopri5.

متن کامل

High Order Explicit Two - Step Runge - Kutta

In this paper we study a class of explicit pseudo two-step Runge-Kutta methods (EPTRK methods) with additional weights v. These methods are especially designed for parallel computers. We study s-stage methods with local stage order s and local step order s + 2 and derive a suucient condition for global convergence order s+2 for xed step sizes. Numerical experiments with 4-and 5-stage methods sh...

متن کامل

Parallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers

This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...

متن کامل

Performance of explicit pseudo two - step RKNmethods on a shared memory computer

The aim of this paper is to investigate the performance of two explicit pseudo two-step RKN methods (EPTRKN methods) of order 6 and 10 for nonstii problems y 00 (t) = f(t;y(t)), y(t 0) = y 0 , y 0 (t 0) = y 0 0. For expensive problems, the parallel implementation on a shared memory computer gives a good speed-up with respect to the sequential one. Furthermore, for numerical comparisons, we solv...

متن کامل

High-accuracy alternating segment explicit-implicit method for the fourth-order heat equation

Based on a group of new Saul’yev type asymmetric difference schemes constructed by author, a high-order, unconditionally stable and parallel alternating segment explicit-implicit method for the numerical solution of the fourth-order heat equation is derived in this paper. The truncation error is fourth-order in space, which is much more accurate than the known alternating segment explicit-impli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997